package com.kevinkk.linklist;

/**
 * 给你单链表的头节点 head ，请你反转链表，并返回反转后的链表
 *
 * 注意是反转整个链表，而不是两两节点相互交换
 */

public class ReverseLinkedList {
    class Solution {
        public ListNode reverseList(ListNode head) {
            ListNode dummy = null, pre = dummy, cur = head;
            while (cur != null) {
                ListNode next = cur.next;
                cur.next = pre;
                pre = cur;
                cur = next;
            }

            return pre;
        }
    }
}
